Ju l 2 00 6 A unified approach to polynomial sequences with only real zeros ∗
نویسندگان
چکیده
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for certain classes of graphs, while showing that they are false in general.
منابع مشابه
2 7 N ov 2 00 6 A unified approach to polynomial sequences with only real zeros ∗
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for cer...
متن کاملA unified approach to polynomial sequences with only real zeros
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for cer...
متن کاملPolynomial Sequences with Only Real Zeros
In this paper we develop methods to provide unified approaches to the reality of zeros of polynomial sequences satisfying certain recurrence relations and then apply them to derive some known results and solve certain open problems and conjectures.
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملIterated Sequences and the Geometry of Zeros
We study the effect on the zeros of generating functions of sequences under certain non-linear transformations. Characterizations of Pólya– Schur type are given of the transformations that preserve the property of having only real and non-positive zeros. In particular, if a polynomial a0 + a1z + · · · + anzn has only real and non-positive zeros, then so does the polynomial a 2 0 +(a 1 − a0a2)z ...
متن کامل